Students’ Performances in Solving 2nd Degree Equations with One Unknown
نویسندگان
چکیده
منابع مشابه
Solving Linear Equations Modulo Unknown Divisors: Revisited
We revisit the problem of finding small solutions to a collection of linear equations modulo an unknown divisor p for a known composite integer N . In CaLC 2001, Howgrave-Graham introduced an efficient algorithm for solving univariate linear equations; since then, two forms of multivariate generalizations have been considered in the context of cryptanalysis: modular multivariate linear equation...
متن کاملSolving Simultaneous Modular Equations of Low Degree
We consider the problem of solving systems of equations Pi(x) 0 (mod ni) i = 1 : : : k where Pi are polynomials of degree d and the ni are distinct relatively prime numbers and x < min(ni). We prove that if k > d(d+1) 2 we can recover x in polynomial time provided min(ni) > 2 d . As a consequence the RSA cryptosystem used with a small exponent is not a good choice to use as a public key cryptos...
متن کاملGGMRES: A GMRES--type algorithm for solving singular linear equations with index one
In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...
متن کاملThe solving linear one-dimemsional Volterra integral equations of the second kind in reproducing kernel space
In this paper, to solve a linear one-dimensional Volterra integral equation of the second kind. For this purpose using the equation form, we have defined a linear transformation and by using it's conjugate and reproducing kernel functions, we obtain a basis for the functions space.Then we obtain the solution of integral equation in terms of the basis functions. The examples presented in this ...
متن کاملA Condition Number Analysis of an Algorithm for Solving a System of Polynomial Equations with One Degree of Freedom
This article considers the problem of solving a system of n real polynomial equations in n+1 variables. We propose an algorithm based on Newton’s method and subdivision for this problem. Our algorithm is intended only for nondegenerate cases, in which case the solution is a 1-dimensional curve. Our first main contribution is a definition of a condition number measuring reciprocal distance to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia - Social and Behavioral Sciences
سال: 2015
ISSN: 1877-0428
DOI: 10.1016/j.sbspro.2015.07.040